The Class Of Statically Deceptive Problems Is NP-Turing Complete

This paper identiies the complexity class of statically constructed partially deceptive problems by proving a turing reduction of 3-SAT problem to partially deceptive problem. This essentially proves that the class of partially deceptive problems is NP-turing complete and one may not be able to nd a polynomial complexity algorithm for solving deceptive problems unless P = NP. This paper also addresses the issue of either constructing a non-deceptive representation or somehow transforming the problem itself to a non-deceptive one. It is observed that such eeorts are likely to rely on the a priori knowledge of the order of deception. Unfortunately, determining the order of deception turns out to be an NP-hard problem. Abstract This paper identiies the complexity class of statically constructed partially deceptive problems by proving a turing reduction of 3-SAT problem to partially deceptive problem. This essentially proves that the class of partially deceptive problems is NP-turing complete and one may not be able to nd a polynomial complexity algorithm for solving deceptive problems unless P = NP. This paper also addresses the issue of either constructing a non-deceptive representation or somehow transforming the problem itself to a non-deceptive one. It is observed that such eeorts are likely to rely on the a priori knowledge of the order of deception. Unfortunately, determining the order of deception turns out to be an NP-hard problem.